A numerical accuracy consideration in polynomial deflation
نویسندگان
چکیده
منابع مشابه
Numerical Accuracy Evaluation for Polynomial Computation
Fixed-point conversion requires fast analytical methods to evaluate the accuracy degradation due to quantization noises. Usually, analytical methods do not consider the correlation between quantization noises. Correlation between quantization noises occurs when a data is quantized several times. This report explained, through an example, the methodology used in the ID.Fix tool to support correl...
متن کاملHigher-Order Deflation for Polynomial Systems with Isolated Singular Solutions
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton’s method. Using first-order derivatives of the polynomials in the system, our method creates an augmented system of equations which has the multiple isolated solution of the original system as a regular...
متن کاملNewton's method with deflation for isolated singularities of polynomial systems
We present a modification of Newton’s method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution as a regular root. We show that the number of deflation stages is bounded by the multiplicity of the isolated root. Our implementation performs well on a la...
متن کاملNumerical Univariate Polynomial GCD
We formalize the notion of approximate GCD for univariate poly-nomials given with limited accuracy and then address the problem of its computation. Algebraic concepts are applied in order to provide a solid foundation for a numerical approach. We exhibit the limitations of the euclidean algorithm through experiments, show that existing methods only solve part of the problem and assert its worst...
متن کاملA numerical elimination method for polynomial computations
A numerical elimination method is presented in this paper for floating-point computation in polynomial algebra. The method is designed to calculate one or more polynomials in an elimination ideal by a sequence of matrix rank/kernel computation. The method is reliable in numerical computation with verifiable stability and a sensitivity measurement. Computational experiment shows that the method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1978
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1978-0502003-1